Charnes–Cooper scalarization and convex vector optimization
نویسندگان
چکیده
منابع مشابه
Well-posedness and scalarization in vector optimization
In this paper we study several existing notions of well-posedness for vector optimization problems. We distinguish them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are ...
متن کاملOn Scalarization of Vector Optimization Type Problems
We consider scalarization issues for vector problems in the case where the preference relation is represented by a rather arbitrary set. An algorithm for weights choice for a priori unknown preference relations is suggested. Some examples of applications to vector optimization, game equilibrium, and variational inequalities are described. DOI: 10.3103/S1066369X12090022
متن کاملScalarization and sensitivity analysis in Vector Optimization. The linear case
In this paper we consider a vector optimization problem; we present some scalarization techniques for finding all the vector optimal points of this problem and we discuss the relationships between these methods. Moreover, in the linear case, the study of dual variables is carried on by means of sensitivity analysis and also by a parametric approach. We also give an interpretation of the dual va...
متن کاملDuality for vector optimization problems via a general scalarization
Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the perturbation function are particularized, different dual vector problems are obtained, some of them already known in the l...
متن کاملCharacterizations of Convex Vector Functions and Optimization
In this paper we characterize nonsmooth convex vector functions by first and second order generalized derivatives. We also prove optimality conditions for convex vector problems involving nonsmooth data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2019
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-019-01502-0